Parallelizing a Simple Chess Program
نویسنده
چکیده
In a closely watched match in 1997, the parallel chess supercomputer Deep Blue defeated then world champion Garry Kasparov 3 12 to 2 1 2 . The fruits of Moore’s law combined with steadily improving chess algorithms now allow programs such as Deep Fritz to challenge human grandmasters while running on nothing more than a commodity 4-way SMP workstation. This paper provides a short overview of the parallel chess algorithms that help achieve these feats and details the implementation of a simple parallel chess program. It also muses about possible methods for extracting additional parallelism using reconfigurable hardware.
منابع مشابه
Techniques to Parallelize Chess
Computer chess has, over the years, served as a metric for showing the progress of computer science. It was a momentous occasion when IBM’s Deep Blue was able to defeat world champion Garry Kasparov. Many hardware based chess computers have been developed; however in an age of multi-core it will be expected that the progress will continue to advance despite the end of the free lunch given by Mo...
متن کاملThe Technology Chess Program
A chess program has been developed which plays good chess (for a program) using a very simple structure. It is based on a brute force search of the move tree with no forward pruning, using material as the only terminal evaluation function, and using a limited positional analysis at the top level for a tiebreak between moves which are materially equal. Because of the transparent structure, this ...
متن کاملAnalysis of Performance of Consultation Methods in Computer Chess
The performance of consultation methods, i.e., majority voting, the optimistic selection rule, and the pseudo-random number (PRN) ensemble method, are examined in computer chess using 2180 chess problems. Here, the optimistic selection rule selects a program that returns the highest search value, and the PRN ensemble consists of multiple individual copies of one base program, and each copy is d...
متن کاملAuditory memory function in expert chess players
Background: Chess is a game that involves many aspects of high level cognition such as memory, attention, focus and problem solving. Long term practice of chess can improve cognition performances and behavioral skills. Auditory memory, as a kind of memory, can be influenced by strengthening processes following long term chess playing like other behavioral skills because of common processing pat...
متن کاملNear fine grain parallel processing using a multiprocessor with MAPLE
Multi-grain parallelizing scheme is one of effective parallelizing schemes which exploits various level parallelism: coarse-grain(macro-dataflow), medium-grain(loop level parallelizing) and near-fine-grain(statements parallelizing) from a sequential program. A multi-processor ASCA is designed for efficient execution of multi-grain parallelizing program. A processing element called MAPLE are mai...
متن کامل